#include <iostream>
#include <queue>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <set>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
char a[1000010];
char b[1000010];
void solve()
{
	cin>>a;
	int len=strlen(a);
	int idx=0;
	for(int i=len-1;i>=0;i--)
	{
		b[idx++]=a[i];
	}
	b[len]='\0';
	if(strcmp(a,b)==0)
	{
		cout<<"yes"<<endl;
	}
	else cout<<"no"<<endl; 
}
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		solve();
	}

	return 0;
}

